Primal and Dual Approaches to Distributed Cross - Layer Optimization ?

نویسندگان

  • Björn Johansson
  • Mikael Johansson
چکیده

Several approaches for cross-layer design, e.g., coordinating the traditionally separated layers in wireless networks, have been proposed. However, protocols that are close to achieving the performance bounds are still lacking. We propose three distributed algorithms for joint congestion control and resource allocation in networks with variable capacities subject to a global resource constraint. Examples include spectrum assignment in wireless networks and wavelength allocation in optical networks. For scalability, we impose the additional constraint that nodes can only negotiate and exchange resources with their neighbors. The proposed algorithms consist of two complementary approaches based on decomposition techniques, in which congestion control and resource allocations are performed on different time-scales. Two of the algorithms can be shown to converge without network delays. Copyright c © 2005 IFAC

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Distributed Newton Approach for Joint Multi-Hop Routing and Flow Control: Theory and Algorithm

The fast growing scale and heterogeneity of current communication networks necessitate the design of distributed cross-layer optimization algorithms. So far, the standard approach of distributed cross-layer design is based on dual decomposition and the subgradient algorithm, which is a first-order method that has a slow convergence rate. In this paper, we focus on solving a joint multi-path rou...

متن کامل

Primal-dual path-following algorithms for circular programming

Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...

متن کامل

Primal and dual robust counterparts of uncertain linear programs: an application to portfolio selection

This paper proposes a family of robust counterpart for uncertain linear programs (LP) which is obtained for a general definition of the uncertainty region. The relationship between uncertainty sets using norm bod-ies and their corresponding robust counterparts defined by dual norms is presented. Those properties lead us to characterize primal and dual robust counterparts. The researchers show t...

متن کامل

Some Duality Results in Grey Linear Programming Problem

Different approaches are presented to address the uncertainty of data and appropriate description of uncertain parameters of linear programming models. One of them is to use the grey systems theory in modeling such problem. Especially, recently, grey linear programming has attracted many researchers. In this paper, a kind of linear programming with grey coefficients is discussed. Introducing th...

متن کامل

Stability of primal-dual gradient dynamics and applications to network optimization

This paper considers dynamic laws that seek a saddle point of a function of two vector variables, by moving each in the direction of the corresponding partial gradient. This method has old roots in the classical work of Arrow, Hurwicz and Uzawa on convex optimization, and has seen renewed interest with its recent application to resource allocation in communication networks. This paper brings ot...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005